Linear Codes for Broadcasting With Noisy Side Information
نویسندگان
چکیده
منابع مشابه
Linear Codes for Broadcasting with Noisy Side Information
We consider network coding for a noiseless broadcast channel where each receiver demands a subset of messages available at the transmitter and is equipped with noisy side information in the form an erroneous version of the message symbols it demands. We view the message symbols as elements from a finite field and assume that the number of symbol errors in the noisy side information is upper bou...
متن کاملPrecoding for Broadcasting with Linear Network Codes
A technique based on linear precoding is introduced for broadcasting on linear networks. The precoding allows the different message components of a broadcast message to be separated and decoded at the desired sink nodes, thus providing a systematic design methodology for broadcasting over a given network with a given linear network code. To achieve a good throughput, however, the network code i...
متن کاملSecure Broadcasting With Side-Information
In this paper, we derive information-theoretic performance limits for secure and reliable communications over the general two-user discrete memoryless broadcast channel with side-information at the transmitter. The sender wishes to broadcast two independent messages to two receivers, under the constraint that each message should be kept confidential from the unintended receiver. Furthermore, th...
متن کاملMatrix Completion with Noisy Side Information
We study the matrix completion problem with side information. Side information has been considered in several matrix completion applications, and has been empirically shown to be useful in many cases. Recently, researchers studied the effect of side information for matrix completion from a theoretical viewpoint, showing that sample complexity can be significantly reduced given completely clean ...
متن کاملSimple Bounds for Noisy Linear Inverse Problems with Exact Side Information
This paper considers the linear inverse problem where we wish to estimate a structured signal x0 from its corrupted observations. When the problem is ill-posed, it is natural to associate a convex function f (·) with the structure of the signal. For example, l1 norm can be used for sparse signals. To carry out the estimation, we consider two well-known convex programs: 1) Second order cone prog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2019
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2019.2893617